Modular Multiset Rewriting
نویسندگان
چکیده
Rule-based languages are being used for ever more ambitious applications. As program size grows however, so does the overhead of team-based development, reusing components, and just keeping a large flat collection of rules from interfering. In this paper, we propose a module system for a small logicallymotivated rule-based language. The resulting modules are nothing more than rewrite rules of a specific form, which are themselves just logic formulas. Yet, they provide some of the same features found in advanced module systems such as that of Standard ML, in particular name space separation, support for abstract data types, and parametrization (functors in ML). Our modules also offer essential features for concurrent programming such as facilities for sharing private names. This approach is directly applicable to other rule-based languages, including most forward-chaining logic programming languages and many process algebras.
منابع مشابه
Modular Multiset Rewriting in Focused Linear Logic
Traditional multiset rewriting arises from a fragment of polarized linear logic, deriving its semantics from focused proof search. In recent years, languages based on multiset rewriting have been used for ever more ambitious applications. As program size grows however, so does the overhead of team-based development and the need for reusing components. Furthermore, there is a point where keeping...
متن کاملT C C F
We review links between three logic formalisms and three approaches to specifying operational semantics. In particular, we show that specifications written with (small-step and big-step) SOS, abstract machines, and multiset rewriting, are closely related to Horn clauses, binary clauses, and (a subset of) linear logic, respectively. We shall illustrate how binary clauses form a bridge between th...
متن کاملType Checking for a Multiset Rewriting Language
We enhance Gamma, a multiset rewriting language, with a notion of structured multiset. A structured multiset is a set of addresses satisfying speci c relations which can be used in the rewriting rules of the program. A type is de ned by a context-free graph grammar and a structured multiset belongs to a type T if its underlying set of addresses satis es the invariant expressed by the grammar de...
متن کاملPetri Nets as Multiset Rewriting Systems in a Linear Framework Contents 1 Introduction 1 2 Multisets and Multiset Rewriting Systems 2
متن کامل
Maximally Parallel Multiset-Rewriting Systems: Browsing the Configurations
The aim of this research is to produce an algorithm for the software that would let a researcher to observe the evolution of maximally parallel multiset-rewriting systems with permitting and forbidding contexts, browsing the configuration space by following transitions like following hyperlinks in the World-Wide Web. The relationships of maximally parallel multiset-rewriting systems with other ...
متن کامل